A Simple and Efficient Algorithm For Solving Three Objective Integer Programs

We present a new variant of the full (p − 1)-split algorithm, the Quadrant Shrinking Method, for finding all nondominated points of a triobjective integer program. The algorithm is easy to implement and solves at most 3|YN |+1 single-objective integer programs, where YN is the set of all nondominated points, when computing the entire nondominated frontier. A computational study demonstrates the efficacy of the proposed method.